Some Mappings Associated with the Permutation Groups
نویسندگان
چکیده
منابع مشابه
Some counting problems related to permutation groups
1 'I count a lot of things that there's no need to count,' Cameron said. 'Just because that's the way I am. But I count all the things that need to be counted.' A relational structure M consists of a set X and a family of relations on X. The age of M is the class of finite relational structures (in the same language) embeddable in M.
متن کاملSome Algorithms for Nilpotent Permutation Groups
(Received) Let G, H and E be subgroups of a nite nilpotent permutation group of degree n. We describe the theory and implementation of an algorithm to compute the normalizer N G (H) in time polynomial in n, and we give a modiied algorithm to determine whether H and E are conjugate under G and, if so, to nd a conjugating element of G. Other algorithms produce the intersection G \ H and the centr...
متن کاملsymmetry classes of polynomials associated with the direct product of permutation groups
let $g_{i} $ be a subgroup of $ s_{m_{i}} , 1 leq i leq k$. suppose $chi_{i}$ is an irreducible complex character of $g_{i}$. we consider $ g_{1}times cdots times g_{k} $ as subgroup of $ s_{m} $, where $ m=m_{1}+cdots +m_{k} $. in this paper, we give a formula for the dimension of $h_{d}(g_{1}times cdots times g_{k}, chi_{1}timescdots times chi_{k})$ and investigate the existe...
متن کاملThe Erdős-Ko-Rado property for some permutation groups
A subset in a groupG ≤ Sym(n) is intersecting if for any pair of permutations π, σ in the subset there is an i ∈ {1, 2, . . . , n} such that π(i) = σ(i). If the stabilizer of a point is the largest intersecting set in a group, we say that the group has the Erdős-Ko-Rado (EKR) property. Moreover, the group has the strict EKR property if every intersecting set of maximum size in the group is the ...
متن کاملPERMUTATION GROUPS WITH BOUNDED MOVEMENT ATTAINING THE BOUNDS FOR ODD PRIMES
Let G be a transitive permutation group on a set ? and let m be a positive integer. If no element of G moves any subset of ? by more than m points, then |? | [2mp I (p-1)] wherep is the least odd primedividing |G |. When the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, I i n....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 1977
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-1977-012-0